Demonstrating quantum algorithm acceleration with NMR quantum computer
نویسندگان
چکیده
منابع مشابه
Implementation of QECC with NMR quantum computer
We propose an implementation of a 3-qubit bit-flip QECC proposed in [1] using an NMRquantum computer. A qubit state ∣ ⟩ = a∣0⟩+ b∣1⟩ is encoded as ∣Ψ⟩ = a∣000⟩+ b∣111⟩ andsent through a noisy channel. It is assumed that the bit-flip operator X acts on one of thequbits during transmission.We show that the recovery operation can be implemented with a unitary quantumcircuit...
متن کاملExperimental Implementation of Hogg’s Algorithm on a Three-Quantum-bit NMR Quantum Computer
Using nuclear magnetic resonance (NMR) techniques with three-qubit sample, we have experimentally implemented the highly structured algorithm for the 1-SAT problem proposed by Hogg. A simplified temporal averaging procedure was employed to the three-qubit spin pseudo-pure state. The algorithm was completed with only a single evaluation of structure of the problem and the solutions were found wi...
متن کاملRealizing the quantum baker’s map on an NMR quantum computer
By numerically simulating an implementation of the quantum baker’s map on an NMR quantum computer based on the molecule trichloroethylene, we demonstrate the feasibility of quantum chaos experiments on present-day quantum computers. We give detailed descriptions of proposed experiments that investigate (a) the rate of entropy increase due to decoherence and (b) the phenomenon of hypersensitivit...
متن کاملQuantum Computation with NMR
A novice seeking to understand Nuclear Magnetic Resonance Quantum Computation (NMR QC) faces a formidable task. Not only is it necessary to master two new fields (NMR and QC), but many of the early papers in the field are unusually difficult to understand. Part of this opacity is, no doubt, due to the speed with which the early manuscripts were written, but an even more important cause was the ...
متن کاملNMR implementation of a quantum scheduling algorithm
The scheduling algorithm solves the intersection problem, i.e., the problem is to find common elements in two sets. Let Alice and Bob be two distant parties who wish to collaborate on a common task. They each have a schedule listing N slots of time. Their schedules can be represented as two stings if Alice and Bob each have N qubits. For each person, the state |1 > denotes that a slot is availa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2004
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.70.052319